On the Null Space Constant for <formula formulatype="inline"><tex Notation="TeX">${\ell _p}$</tex></formula> Minimization
نویسندگان
چکیده
منابع مشابه
On the Null Space Constant for Minimization
The literature on sparse recovery often adopts the “norm” ( ) as the penalty to induce sparsity of the signal satisfying an underdetermined linear system. The performance of the corresponding minimization problem can be characterized by its null space constant. In spite of the NP-hardness of computing the constant, its properties can still help in illustrating the performance of minimization. I...
متن کاملOn the Null Space Constant for ℓp Minimization
The literature on sparse recovery often adopts the `p “norm” (p ∈ [0, 1]) as the penalty to induce sparsity of the signal satisfying an underdetermined linear system. The performance of the corresponding `p minimization problem can be characterized by its null space constant. In spite of the NP-hardness of computing the constant, its properties can still help in illustrating the performance of ...
متن کاملLength Minimization for Space Curves Undernonholonomic Constraints : the Constant Torsion
The Griiths formalism is applied to nd constant torsion curves which are extremal for arclength with respect to variations preserving torsion, xing the endpoints and the binormals at the endpoints. The critical curves are elastic rods of constant torsion, which are shown to not realize certain boundary conditions. In the calculus of variations under nonholonomic constraints, one tries to nd the...
متن کاملNull space conditions and thresholds for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in machine learning, control theory, and discrete geometry. This class of optimization problems, known as rank minimization, is NP-HARD, and for most practical problems there are no efficient algorithms that yield exact solutions. A popular heuristic replaces the rank function with t...
متن کاملOn Approximate Horn Formula Minimization
The minimization problem for Horn formulas is to find a Horn formula equivalent to a given Horn formula, using a minimum number of clauses. A 2 1−ǫ(n)-inapproximability result is proven, which is the first inapproximability result for this problem. We also consider several other versions of Horn minimization. The more general version which allows for the introduction of new variables is known t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2015
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2015.2416003